On a conjecture of Erdös and Silverman in combinatorial geometry
نویسندگان
چکیده
منابع مشابه
On a conjecture of Erdös, Graham and Spencer, II
It is conjectured by Erdős, Graham and Spencer that if 1 ≤ a1 ≤ a2 ≤ · · · ≤ as are integers with ∑s i=1 1/ai < n − 1/30, then this sum can be decomposed into n parts so that all partial sums are ≤ 1. This is not true for ∑s i=1 1/ai = n − 1/30 as shown by a1 = · · · = an−2 = 1, an−1 = 2, an = an+1 = 3, an+2 = · · · = an+5 = 5. In 1997 Sandor proved that Erdős–Graham–Spencer conjecture is true ...
متن کاملon translation of politeness strategies in dialogues involving female characters in translations and retranslations of novels translated before and after the islamic revolution of iran and their effects on the image of women: a polysystem theory approach
abstract reception environment has considerable effects on accepting a translation. as the expectations of a target culture and its values and needs change throughout history, its criteria for accepting a translation or rejecting it will change accordingly (gentzler, 2001). the expectations of iran, as the reception environment in the present study, have changed after the islamic revolution. i...
On a Combinatorial Conjecture
Recently, Tu and Deng [3] proposed a combinatorial conjecture about binary strings, and, on the assumption that the conjecture is correct, they obtained two classes of Boolean functions which are both algebraic immunity optimal, the first of which are also bent functions. The second class gives balanced functions, which have optimal algebraic degree and the best nonlinearity known up to now. In...
متن کاملErdös Conjecture on Connected Residual Graphs
A graph G is said to be F-residual if for every point u in G, the graph obtained by removing the closed neighborhood of u from G is isomorphic to F. Similarly, if the remove of m consecutive closed neighborhoods yields Kn, then G is called m-Kn-residual graph. Erdös determine the minimum order of the m-Kn-residual graph for all m and n, the minimum order of the connected Kn-residual graph is fo...
متن کاملA note on the jumping constant conjecture of Erdös
Let r 2 be an integer. The real number α ∈ [0,1] is a jump for r if there exists c > 0 such that for every positive and every integer m r , every r-uniform graph with n > n0( ,m) vertices and at least (α + )(nr) edges contains a subgraph with m vertices and at least (α + c)(mr ) edges. A result of Erdős, Stone and Simonovits implies that every α ∈ [0,1) is a jump for r = 2. For r 3, Erdős asked...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1980
ISSN: 0097-3165
DOI: 10.1016/0097-3165(80)90036-9